Piggyback dualities revisited

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Old-fashioned Dualities Revisited

In the lectures given at ’96 Kashikojima Summer Institute, Amagi-Highland Seminars, and Yukawa Institute Workshop, the old-fashioned dualities and the theory of extended objects are reviewed, starting from ’t Hooft-Mandelstam duality and following the author’s old works. Application of the old-fashioned dualities to new issues are also given on the D-branes, on the phase transition of B-F theor...

متن کامل

Piggyback orthotopic intestinal transplantation.

PORTAL, as opposed to systemic, venous drainage from small intestinal allografts is thought to be preferable because it provides unquestionable physiologic (1-3) and hypothetic, but unverified (4,5) immunologic advantages. However, in clinical instances, it may be difficult to find a place on the recipient portal or superior mesenteric vein (SMV) where the donor portal vein can be anastomosed. ...

متن کامل

Piggyback intraocular lens implantation.

The piggyback method of implanting two intraocular lenses in one eye has been successfully expanded to address pseudophakic refractive error in normal eyes and eyes that have undergone post-penetrating keratoplasty. Piggyback implantation has been combined with the use of newly available minus-power lenses to provide appropriate power for a cataract patient with keratoconus, as well as to corre...

متن کامل

Scaling Dualities

In this paper rst we prove four fundamental theorems of the alternative, called scaling dualities, characterizing exact and approximate solvability of four signi cant conic problems in nite dimensional spaces, de ned as: homogeneous programming (HP), scaling problem (SP), homogeneous scaling problem (HSP), and algebraic scaling problem (ASP). Let be a homogeneous function of degree p > 0, K a p...

متن کامل

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebra universalis

سال: 2016

ISSN: 0002-5240,1420-8911

DOI: 10.1007/s00012-016-0395-y